Convergence Time to Equilibrium for Large Nite Markov Chains
نویسنده
چکیده
For a sequence of nite Markov chains L(N) we introduce the notion of \conver-gence time to equilibrium" T(N). For sequences that are obtained by truncating some countable Markov chain L we nd the convergence time to equilibrium in terms of Lyapunov function of Markov chain L. We apply this result to queue-ing systems with a limited number of customers: a priority system with several customer types and the Jackson network.
منابع مشابه
Convergence Time to Equilibrium for Multi-particle Markov Chains
Multi-particle Markov chains L(N) are stochastic systems consisting of M(N) noninteract-ing particles moving according to the law of some \one-particle" nite Markov chain K(N). Our goal is to nd the convergence time to equilibrium T(N) 1, 2] for the sequence of Markov chains L(N) in the situation when the number of particles M(N) tends to innnity and the \size" of the one-particle chain K(N) gr...
متن کاملSome universal estimates on convergence to equilibrium in reversible Markov chains∗
We obtain universal estimates on the convergence to equilibrium and the times of coupling for continuous time irreducible reversible finite-state Markov chains, both in the total variation and in the L norms. The estimates in total variation norm are obtained using a novel identity relating the convergence to equilibrium of a reversible Markov chain to the increase in the entropy of its one-dim...
متن کاملHitting and Convergence Time , and Flow Rate , Parameters for Reversible Markov
The elementary theory of general nite Markov chains (cf. Chapter 2) focuses on exact formulas and limit theorems. My view is that, to the extent there is any intermediate-level mathematical theory of reversible chains, it is a theory of inequalities. Some of these were already seen in Chapter 3. This chapter is my attempt to impose some order on the subject of inequalities. We will study the fo...
متن کاملPerfect simulation in stochastic geometry
Simulation plays an important r^ ole in stochastic geometry and related elds, because all but the simplest random set models tend to be intractable to analysis. Many simulation algorithms deliver (approximate) samples of such random set models, for example by simulating the equilibrium distribution of a Markov chain such as a spatial birth-and-death process. The samples usually fail to be exact...
متن کاملConvergence rates of Markov chains for some self-assembly and non-saturated Ising models
Algorithms based on Markov chains are ubiquitous across scientific disciplines as they provide a method for extracting statistical information about large, complicated systems. For some self-assembly models, Markov chains can be used to predict both equilibrium and non-equilibrium dynamics. In fact, the efficiency of these self-assembly algorithms can be related to the rate at which simple chai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997